Blar i NTNU Open på forfatter "Satti, Srinivasa Rao"
-
A Way to Lay Out Argument Maps
Bendiksen, David (Master thesis, 2023)Forfatteren har gjennomført et masterprosjekt i samarbeid med Disputas AS, en norsk oppstartsbedrift som spesialiserer seg innen visualisering av uformell logikk. Målet med prosjektet var å utvikle en graflayoutalgoritme ... -
Approximate query processing over static sets and sliding windows
Basat, Ran Ben; Jo, Seungbum; Satti, Srinivasa Rao; Ugare, Shubham (Journal article; Peer reviewed, 2021)Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we consider the problem of encoding sets and ... -
Encoding Two-Dimensional Range Top-k Queries
Jo, Seungbum; Lingala, Rahul; Satti, Srinivasa Rao (Journal article; Peer reviewed, 2021)We consider the problem of encoding two-dimensional arrays, whose elements come from a total order, for answering Top-k queries. The aim is to obtain encodings that use space close to the information-theoretic lower bound, ... -
Finding kings in tournaments
Biswas, Arindam; Jayapaul, Varunkumar; Raman, Venkatesh; Satti, Srinivasa Rao (Peer reviewed; Journal article, 2022) -
Frameworks for designing in-place graph algorithms
Chakraborty, Sankardeep; Mukherjee, Anish; Raman, Venkaetsh; Satti, Srinivasa Rao (Peer reviewed; Journal article, 2022)Read-only memory (ROM) model is a classical model of computation to study time-space tradeoffs of algorithms. More recently, several graph algorithms have been studied under ROM model. In this paper, we study graph algorithms ... -
SJSON: A succinct representation for JSON documents
Lee, Junhee; Anjos, Edman; Satti, Srinivasa Rao (Journal article; Peer reviewed, 2021)The massive amounts of data processed in modern computational systems are becoming a problem of increasing importance. This data is commonly stored directly or indirectly through the use of data exchange languages, such ... -
Succinct Data Structures for SP, Block-Cactus and 3 -Leaf Power Graphs
Chakraborty, Sankardeep; Jo, Seungbum; Sadakane, Kunihiko; Satti, Srinivasa Rao (Journal article; Peer reviewed, 2023)We design succinct encodings of series-parallel, block-cactus and 3-leaf power graphs while supporting the basic navigational queries such as degree, adjacency and neighborhood optimally in the RAM model with logarithmic ... -
Succinct Encodings for Families of Interval Graphs
Acan, Huseyin; Chakraborty, Sankardeep; Jo, Seungbum; Satti, Srinivasa Rao (Journal article; Peer reviewed, 2021)We consider the problem of designing succinct data structures for interval graphs with n vertices while supporting degree, adjacency, neighborhood and shortest path queries in optimal time. Towards showing succinctness, ... -
Succinct navigational oracles for families of intersection graphs on a circle
Acan, Huseyin; Chakraborty, Sankardeep; Jo, Seungbum; Nakashima, Kei; Sadakane, Kunihiko; Satti, Srinivasa Rao (Peer reviewed; Journal article, 2022)We consider the problem of designing succinct navigational oracles, i.e., succinct data structures supporting basic navigational queries such as degree, adjacency and neighborhood efficiently for intersection graphs on a ... -
Succinct representation for (non)deterministic finite automata.
Chakraborty, Sankardeep; Grossi, Roberto; Sadakane, Kunihiko; Satti, Srinivasa Rao (Peer reviewed; Journal article, 2023)(Non)-Deterministic finite automata are one of the simplest models of computation studied in automata theory. Here we study them through the lens of succinct data structures. Towards this goal, we design a data structure ...